Underwater Pragmatic Routing Approach Through Packet Reverberation Mechanism

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Leach Routing Algorithm Optimization through Imperialist Approach

Routing is an important challenge in WSN due to the presence of hundreds or thousands of sensor nodes. Low Energy Adaptive Clustering Hierarchy (LEACH) is a hierarchical routing and data dissemination protocol. LEACH divides a network domain into several sub-domains that are called clusters. Non-uniformity of cluster distribution and CHs selection without considering the positions of other sens...

متن کامل

A Parametric Chain based Routing Approach for Underwater Sensor Network

A sensor network is one of the critical networks that is based on hardware components as well the energy parameters. Because of this, such network requires the optimization in all kind communication to improve the network life. In case of underwater sensor network, the criticality of network is also increased because of the random floating movement of the nodes. In this work, a composition of t...

متن کامل

Virtual Cut - Through Implementation of the HB Packet Switching Routing

In the last years, since the early 80’s, wormhole and virtual cut-through routing modalities have replaced packet switching and circuit switching schemes. In this paper we give the theoretical bases to implement hole based (HB) routing algorithm [3] by using the virtual cut-through

متن کامل

A Secure Routing Algorithm for Underwater Wireless Sensor Networks

Recently, underwater Wireless Sensor Networks (UWSNs) attracted the interest of many researchers and the past three decades have held the rapid progress of underwater acoustic communication. One of the major problems in UWSNs is how to transfer data from the mobile node to the base stations and choosing the optimized route for data transmission. Secure routing in UWSNs is necessary for packet d...

متن کامل

Packet Routing in Dynamically Changing Networks: A Reinforcement Learning Approach

This paper describes the Q-routing algorithm for packet routing, in which a reinforcement learning module is embedded into each node of a switching network. Only local communication is used by each node to keep accurate statistics on which routing decisions lead to minimal delivery times. In simple experiments involving a 36-node, irregularly connected network, Q-routing proves superior to a no...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2020

ISSN: 2169-3536

DOI: 10.1109/access.2020.3022565